Algorithms for the variable sized bin packing problem

In this paper, we consider the variable sized bin packing problem where the objective is to minimize the total cost of used bins when the cost of unit size of each bin does not increase as the bin size increases. Two greedy algorithms are described, and analyzed in three special cases: (a) the sizes of items and bins are divisible, respectively, (b) only the sizes of bins are divisible, and (c) the sizes of bins are not divisible. Here, we say that a list of numbers a1; a2; . . . ; am are divisible when aj exactly divides aj 1, for each 1 < j6m. In the case of (a), the algorithms give optimal solutions, and in the case of (b), each algorithm gives a solution whose value is less than 11 9 CðB Þ þ 4 9 , where CðB Þ is the optimal value. In the case of (c), each algorithm gives a solution whose value is less than 3 2 CðB Þ þ 1. 2002 Elsevier Science B.V. All rights reserved.